CCA-Secure IB-KEM from Identity-Based Extractable Hash Proof System
نویسندگان
چکیده
In this paper, we introduce a general paradigm called identity-based extractable hash proof system (IB-EHPS), which is an extension of extractable hash proof system (EHPS) proposed by Wee (CRYPTO ’10). We show how to construct identity-based key encapsulation mechanism (IB-KEM) from IB-EHPS in a simple and modular fashion. Our construction provides a generic method of building and interpreting CCA-secure IB-KEMs based on computational assumptions. As instantiations, we realize IB-EHPS from the bilinear Diffie-Hellman assumption and the modified bilinear Diffie-Hellman assumption, respectively. Besides, we carefully investigate the relation between EHPS and IB-EHPS, and indicate possible refinement and generalization of EHPS.
منابع مشابه
CCA-Secure IB-KEM from Identity-Based Extractable Hash Proof Systems
In this paper, we introduce a general paradigm called identity-based extractable hash proof system (IB-EHPS), which is an extension of extractable hash proof system (EHPS) proposed by Wee (CRYPTO ’10). We show how to construct identity-based key encapsulation mechanism (IB-KEM) from IB-EHPS in a simple and modular fashion. Our construction provides a generic method of building and interpreting ...
متن کاملKey Encapsulation Mechanisms from Extractable Hash Proof Systems, Revisited
In CRYPTO 2010, Wee proposed the notion of “extractable hash proof systems” (XHPS), and its richer version, “all-but-one XHPS” (ABO-XHPS), and showed that chosen ciphertext secure (CCA secure) key encapsulation mechanisms (KEM) can be constructed from them. This elegantly explains several recently proposed practical KEMs constructed based on the “all-but-one” simulation paradigm in a unified fr...
متن کاملCCA Secure IB-KEM from the Computational Bilinear Diffie-Hellman Assumption in the Standard Model
In this paper, we propose several selective-identity chosen-ciphertext attack secure identity based key encapsulation (IB-KEM) schemes that are provably secure under the computational bilinear Diffie-Hellman (CBDH) assumption in the standard model. Our schemes compare favorably to previous results in efficiency. With delicate modification, our schemes can be strengthened to be full-identity CCA...
متن کاملCCA-Security for predicate encryption schemes
In this thesis we first take a critical look at established security definitions for predicate encryption with public index (PE) under chosen-plaintext attacks (CPA) and under chosenciphertext attacks (CCA) from the current state of research. In contrast to conventional publickey encryption (PKE), security definitions for PE have to deal with user collusion, which is modeled by an additional ke...
متن کاملEfficient Chosen-Ciphertext Security via Extractable Hash Proofs
We introduce the notion of an extractable hash proof system. Essentially, this is a special kind of non-interactive zero-knowledge proof of knowledge system where the secret keys may be generated in one of two modes to allow for either simulation or extraction. – We show how to derive efficient CCA-secure encryption schemes via extractable hash proofs in a simple and modular fashion. Our constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. J.
دوره 57 شماره
صفحات -
تاریخ انتشار 2014